Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
نویسنده
چکیده
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domains with repetitions. Df-pn(r) cures it by ignoring proof and disproof numbers that may lead to infinite loops. This paper points out that df-pn(r) has a serious issue of underestimating proof and disproof numbers, while it also suffers from the overestimation problem occurring in directed acyclic graph. It then presents two practical solutions to these problems. While bypassing infinite loops, the threshold controlling algorithm (TCA) solves the underestimation problem by increasing the thresholds of df-pn. The source node detection algorithm (SNDA) detects the cause of overestimation and modifies the computation of proof and disproof numbers. Both TCA and SNDA are implemented on top of df-pn to solve tsume-shogi (checkmating problem in Japanese chess). Results show that df-pn with TCA and SNDA is far superior to df-pn(r). Our tsume-shogi solver is able to solve several difficult positions previously unsolved by any other solvers.
منابع مشابه
Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کاملBoundary Shear Stress in a Trapezoidal Channel
This paper focuses on a hydraulic radius separation approach used to calculate the boundary shear stress in terms of bed and wall shear stress proposed in a trapezoidal channel. The average bed and sidewall shear stress in smooth trapezoidal open channels are derived after using Guo & Julien (2005) early equations taking a part of an investigation to cover both rectangular and trapezoidal chann...
متن کاملParallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simple but effective parallelization of the df-pn search algorithm for a shared-memory system. In this parallelization, multiple agents autonomously conduct the df-pn with a shared transposition table. For effective coopera...
متن کاملAppearance of the pattern deviation map as a function of change in area of localized field loss.
PURPOSE To determine the influence of the spatial extent and the depth of localized field loss on the computation of the General Height (GH) method for estimating the diffuse component of visual field loss and, therefore, on the subsequent appearance of the Pattern Deviation (PD) map. METHODS Varying shapes and depths of localized glaucomatous field loss were modeled in each of 82 Humphrey Fi...
متن کاملPDS-PN: A New Proof-Number Search Algorithm
The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and Disproof-number Search (PDS), and at the second level a best-first PN search. First, we thoroughly investigate four established algorithms in the domain of LOA endgame positions: PN, PN, PDS and αβ search. It turns out that PN a...
متن کامل